On a Combinatorial Conjecture

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Combinatorial Conjecture

Recently, Tu and Deng [3] proposed a combinatorial conjecture about binary strings, and, on the assumption that the conjecture is correct, they obtained two classes of Boolean functions which are both algebraic immunity optimal, the first of which are also bent functions. The second class gives balanced functions, which have optimal algebraic degree and the best nonlinearity known up to now. In...

متن کامل

A Note on a Combinatorial Conjecture

It is difficult to find Boolean functions achieving many good cryptographic properties. Recently, Tu and Deng obtained two classes of Boolean functions with good properties based on a combinatorial conjecture about binary strings. In this paper, using different approaches, we prove this conjecture is true in some cases. This conjecture has resisted different attempts of proof since it is hard t...

متن کامل

On the Combinatorial Schoenflies Conjecture

Introduction. The combinatorial version of the Schoenflies conjecture in dimension n states: A combinatorial (n — l)-sphere on a combinatorial «-sphere decomposes the latter into two combinatorial ncells. The cases n = 1, 2 are obvious, the case n = 3 was solved by J. W. Alexander [l], see also W. Graeub [5], and E. Moise [8]. Nothing is known for n>3 (compare J. F. Hudson and E. C. Zeeman in [...

متن کامل

On a Conjecture on Wiener Indices in Combinatorial Chemistry

Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by edges between the corresponding vertices. This polygonal shape derived from a chemical compound is often called its molecular graph, and can be a path, a tree, or in general a graph. An indicator defined over this mol...

متن کامل

# a 17 Integers 11 ( 2011 ) on a Combinatorial Conjecture

Recently, Tu and Deng proposed a combinatorial conjecture about binary strings, and, on the assumption that the conjecture is correct, they obtained two classes of Boolean functions which are both algebraic immunity optimal, the first of which are also bent functions. The second class gives balanced functions, which have optimal algebraic degree and the best nonlinearity known up to now. In thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Integers

سال: 2011

ISSN: 1867-0652

DOI: 10.1515/integ.2011.017